#define _CRT_SECURE_NO_WARNINGS 1
#include "BinaryTreeTraversal.h"
#include "queue.h"
int main()
{
	BTNode* A = (BTNode*)malloc(sizeof(BTNode));
	A->data = 'A';
	A->left = A->right = NULL;
	BTNode* B = (BTNode*)malloc(sizeof(BTNode));
	B->data = 'B';
	B->left = B->right = NULL;
	BTNode* C = (BTNode*)malloc(sizeof(BTNode));
	C->data = 'C';
	C->left = C->right = NULL;
	BTNode* D = (BTNode*)malloc(sizeof(BTNode));
	D->data = 'D';
	D->left = D->right = NULL;
	BTNode* E = (BTNode*)malloc(sizeof(BTNode));
	E->data = 'E';
	E->left = E->right = NULL;
	E->left = E->right = NULL;
	A->left = B;
	A->right = C;
	B->left = D;
	B->right = E;

	int nodeSize = size(A);
	printf("%d\n", nodeSize);

	int leafSize = leafNodeSize(A);
	printf("%d\n", leafSize);
	prev(A);
	printf("\n");
	mid(A);
	printf("\n");
	last(A);
	printf("\n");



	levelOrder(A);

	levelOrder(B);
	levelOrder(E);

	Destroy(A);
	A = NULL;
	levelOrder(A);
	return 0;
}